The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
quot(0, s(y)) → 0
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0, y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
minus, quot, plus, app, sum

They will be analysed ascendingly in the following order:
minus < quot
plus < minus
plus < sum
app < sum

(6) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

The following defined symbols remain to be analysed:
plus, minus, quot, app, sum

They will be analysed ascendingly in the following order:
minus < quot
plus < minus
plus < sum
app < sum

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

Induction Base:
plus(gen_0':s3_0(0), gen_0':s3_0(b)) →_R^Ω(1)
gen_0':s3_0(b)

Induction Step:
plus(gen_0':s3_0(+(n6_0, 1)), gen_0':s3_0(b)) →_R^Ω(1)
s(plus(gen_0':s3_0(n6_0), gen_0':s3_0(b))) →_IH
s(gen_0':s3_0(+(b, c7_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

The following defined symbols remain to be analysed:
minus, quot, app, sum

They will be analysed ascendingly in the following order:
minus < quot
app < sum

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol minus.

(11) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

The following defined symbols remain to be analysed:
quot, app, sum

They will be analysed ascendingly in the following order:
app < sum

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol quot.

(13) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

The following defined symbols remain to be analysed:
app, sum

They will be analysed ascendingly in the following order:
app < sum

(14) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
app(gen_nil:cons4_0(n2624_0), gen_nil:cons4_0(b)) → gen_nil:cons4_0(+(n2624_0, b)), rt ∈ Ω(1 + n2624₀)

Induction Base:
app(gen_nil:cons4_0(0), gen_nil:cons4_0(b)) →_R^Ω(1)
gen_nil:cons4_0(b)

Induction Step:
app(gen_nil:cons4_0(+(n2624_0, 1)), gen_nil:cons4_0(b)) →_R^Ω(1)
cons(0', app(gen_nil:cons4_0(n2624_0), gen_nil:cons4_0(b))) →_IH
cons(0', gen_nil:cons4_0(+(b, c2625_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(15) Complex Obligation (BEST)

(16) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)
app(gen_nil:cons4_0(n2624_0), gen_nil:cons4_0(b)) → gen_nil:cons4_0(+(n2624_0, b)), rt ∈ Ω(1 + n2624₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

The following defined symbols remain to be analysed:
sum

(17) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
sum(gen_nil:cons4_0(+(1, n3462_0))) → gen_nil:cons4_0(1), rt ∈ Ω(1 + n3462₀)

Induction Base:
sum(gen_nil:cons4_0(+(1, 0))) →_R^Ω(1)
cons(0', nil)

Induction Step:
sum(gen_nil:cons4_0(+(1, +(n3462_0, 1)))) →_R^Ω(1)
sum(cons(plus(0', 0'), gen_nil:cons4_0(n3462_0))) →_L^Ω(1)
sum(cons(gen_0':s3_0(+(0, 0)), gen_nil:cons4_0(n3462_0))) →_IH
gen_nil:cons4_0(1)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(18) Complex Obligation (BEST)

(19) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)
app(gen_nil:cons4_0(n2624_0), gen_nil:cons4_0(b)) → gen_nil:cons4_0(+(n2624_0, b)), rt ∈ Ω(1 + n2624₀)
sum(gen_nil:cons4_0(+(1, n3462_0))) → gen_nil:cons4_0(1), rt ∈ Ω(1 + n3462₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

No more defined symbols left to analyse.

(20) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

(21) BOUNDS(n^1, INF)

(22) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)
app(gen_nil:cons4_0(n2624_0), gen_nil:cons4_0(b)) → gen_nil:cons4_0(+(n2624_0, b)), rt ∈ Ω(1 + n2624₀)
sum(gen_nil:cons4_0(+(1, n3462_0))) → gen_nil:cons4_0(1), rt ∈ Ω(1 + n3462₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

No more defined symbols left to analyse.

(23) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

(24) BOUNDS(n^1, INF)

(25) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)
app(gen_nil:cons4_0(n2624_0), gen_nil:cons4_0(b)) → gen_nil:cons4_0(+(n2624_0, b)), rt ∈ Ω(1 + n2624₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

No more defined symbols left to analyse.

(26) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

(27) BOUNDS(n^1, INF)

(28) Obligation:

TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
minus(minus(x, y), z) → minus(x, plus(y, z))
app(nil, k) → k
app(l, nil) → l
app(cons(x, l), k) → cons(x, app(l, k))
sum(cons(x, nil)) → cons(x, nil)
sum(cons(x, cons(y, l))) → sum(cons(plus(x, y), l))
sum(app(l, cons(x, cons(y, k)))) → sum(app(l, sum(cons(x, cons(y, k)))))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
plus :: 0':s → 0':s → 0':s
app :: nil:cons → nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
sum :: nil:cons → nil:cons
hole_0':s1_0 :: 0':s
hole_nil:cons2_0 :: nil:cons
gen_0':s3_0 :: Nat → 0':s
gen_nil:cons4_0 :: Nat → nil:cons

Lemmas:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))
gen_nil:cons4_0(0) ⇔ nil
gen_nil:cons4_0(+(x, 1)) ⇔ cons(0', gen_nil:cons4_0(x))

No more defined symbols left to analyse.

(29) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s3_0(n6_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n6_0, b)), rt ∈ Ω(1 + n6₀)

(30) BOUNDS(n^1, INF)